An Efficient Algorithm for Vertex Enumeration of Two-Dimensional Projection of Polytopes
نویسندگان
چکیده
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices. The complexity of our algorithm is linear in the number of vertices of the projected polytope and we show empirically that the performance is significantly better in comparison to some known efficient algorithms of projection and enumeration.
منابع مشابه
Polynomial time vertex enumeration of convex polytopes of bounded branch-width
In the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by inequalities. In this paper we apply the concept of branch-decomposition to the vertex enumeration problem of polyhedra P = {x : Sx = b, x ≥ 0}. Therefore, we introduce ...
متن کاملEfficient edge-skeleton computation for polytopes defined by oracles
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify problems (and polytope representations) for which total polynomial-time algorithms can be obtained. We offer the first total polynomial-time algorithm for computing...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملComparative computational results for some vertex and facet enumeration codes
We report some computational results comparing parallel and sequential codes for vertex/facet enumeration problems for convex polyhedra. The problems chosen span the range from simple to highly degenerate polytopes. We tested one code (lrs) based on pivoting and four codes (cddr+, ppl , normaliz , porta) based on the double description method. normaliz employs parallelization as do the codes pl...
متن کاملDeformed Products and Maximal Shadows of Polytopes
We present a construction of deformed products of polytopes that has as special cases all the known constructions of linear programs with \many pivots," starting with the famous Klee-Minty cubes from 1972. Thus we obtain sharp estimates for the following geometric quantities for d-dimensional simple polytopes with at most n facets: the maximal number of vertices on an increasing path, the maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.10059 شماره
صفحات -
تاریخ انتشار 2016